Assessing the Behaviour of Polygonal Approximation Algorithms

نویسنده

  • Paul L. Rosin
چکیده

In a recent paper we described a method for assessing the accuracy of polygonal approximation algorithms [16]. Here we develop several measures to assess the stability of such approximation algorithms under variations in their scale parameters. A monotonicity index is introduced that can be applied to analyse the change in the approximation error or the number of line segments against increasing scale. A consistency index quantifies the variation in results produced at the same scale by an algorithm (but with different input parameter values). Finally, the previously developed accuracy figure of merit is calculated and averaged over 21 test curves for different parameter values to obtain more reliable scores.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Techniques for Assessing Polygonal Approximations of Curves

Given the enormous number of available methods for finding polygonal approximations to curves techniques are required to assess different algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing an algorithm’s results relative to an optimal polygon, and describe a measure which combines the relat...

متن کامل

Techniques for Assessing Polygonal Approximations of CurvesPaul

Given the enormous number of available methods for nding polygonal approximations to curves techniques are required to assess diierent algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing an algorithm's results relative to an optimal polygon, and describe a measure which combines the relative...

متن کامل

Characterizing the hierarchical Hough transform through a polygonal approximation algorithm

We propose to study the relationship between the hierachical Hough transform and classical algorithms for partitioning curves into segments. We show that the set of segments found by classical algorithms is a subset of the segments found by the hierarchical Hough transform. This new relationship allows to have a better understanding of the behaviour of some parameters of the hierarchical Hough ...

متن کامل

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

متن کامل

Polygonal approximation of digital planar curves through adaptive optimizations

In this paper, we present a novel non-parametric polygonal approximation algorithm for digital planar curves. The proposed algorithm first selects a set of points (called cut-points) on the contour which are of very ‘high’ curvature. An optimization procedure is then applied to find adaptively the best fitting polygonal approximations for the different segments of the contour as defined by the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition

دوره 36  شماره 

صفحات  -

تاریخ انتشار 1998